Appears in Proceedings of the 23rd IEEE International Conference on Computer Communications (INFOCOMCharacterizing Selfishly Constructed Overlay Routing Networks Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica, and

Source URL: www.oceanstore.org

• Routing algorithms
• Routing
• Link-state routing protocol
• SRS

A Security Enforcement Kernel for OpenFlow Networks Phillip Porras† Seungwon Shin‡ Vinod Yegneswaran† Martin Fong† Mabry Tyson† Guofei Gu‡ † SRI International

Source URL: www.openflowsec.org

• Computing
• Cyberwarfare
• Computer network security
• Computer networking
• OpenFlow
• Network architecture
• Software-defined networking
• Nox
• Firewall
• Computer network
• Computer security
• Denial-of-service attack

An RSSI-based Scheme for Sybil Attack Detection in Wireless Sensor Networks Murat Demirbas, Youngwhan Song Department of Computer Science and Engineering Department State University of New York at Buffalo Buffalo, NY 142

Source URL: www.cse.buffalo.edu

OPAvion: Mining and visualization in large graphs Leman Akoglu∗ , Duen Horng Chau∗ , U Kang∗ , Danai Koutra∗, Christos Faloutsos School of Computer Science Carnegie Mellon University {lakoglu, dchau, ukang, dana

Source URL: www.cs.cmu.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Networks
• Network theory
• Community structure
• Connectivity
• Graph
• Degree distribution
• Directed graph
• Clustering coefficient
• Clique percolation method

Ajil: Distributed Rate-limiting for Multicast Networks Hussam Abu-Libdeh, Ymir Vigfusson, Ken Birman Department of Computer Science Cornell University, Ithaca, NY 14853 {hussam, vigfusson, ken}@cs.cornell.edu Abstract

Source URL: pubs.0xff.co

Bridging the Gap Between Physical Location and Online Social Networks Justin Cranshaw Eran Toch Jason Hong Aniket Kittur Norman Sadeh School of Computer Science, Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh,

Source URL: www.eng.tau.ac.il

Orion: Shortest Path Estimation for Large Social Graphs Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng and Ben Y. Zhao Department of Computer Science, UC Santa Barbara, USA {xiaohanzhao, alessandra, bowlin,

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Networks
• Network analysis
• Edsger W. Dijkstra
• Centrality
• Small-world network
• Shortest path problem
• Graph
• Breadth-first search

Run and Be Safe: Mixed-Criticality Scheduling with Temporary Processor Speedup Pengcheng Huang, Pratyush Kumar, Georgia Giannopoulou, Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, S

Source URL: www.tik.ethz.ch

• Computing
• Engineering
• Technology
• Analysis of parallel algorithms
• Parallel computing
• Speedup
• Real-time computing
• Mixed criticality
• Worst-case execution time
• Scalability

A  New  Approach  to  Name-­‐‑ Based  Link-­‐‑State  Routing   for  Information-­‐‑Centric   Networks Ehsan Hemmati1 J.J. Garcia-Luna-Aceves1,2

Source URL: conferences2.sigcomm.org

• Routing protocols
• Routing
• Computer networking
• Link-state routing protocol
• Hop
• Router
• Interior gateway protocol
• Open Shortest Path First

Institut für Technische Informatik und Kommunikationsnetze Computer Engineering and Networks Laboratory Prof. L. Thiele

Source URL: www.tik.ee.ethz.ch

• Engineering
• Systems engineering
• Embedded system
• Criticality
• Safety engineering
• Mixed criticality